Incremental semantics for propositional texts.
نویسندگان
چکیده
منابع مشابه
Incremental Semantics for Propositional Texts
In this paper we are concerned with the special requirements that a semantics of texts should meet It is argued that a semantics of texts should be incremental and should satisfy the break in principle We develop a semantics for propositional texts that satis es these constraints We will see that our requirements do not only apply to the semantics but also have consequences for the syntax The i...
متن کاملSentential Semantics for Propositional Attitudes
The sentential theory of propositional attitudes is very attractive to AI workers, but it is difficult to use such a theory to assign semantics to English sentences about attitudes. The problem is that a compositional semantics cannot easily build the logical forms that the theory requires. We present a new notation for a sentential theory, and a unification grammar that builds logical forms in...
متن کاملFormal Semantics for Propositional Attitudes
Contemporary logic is confined to a few paradigmatic attitudes such as belief, knowledge, desire and intention. My purpose is to present a general modeltheoretical semantics of propositional attitudes of any cognitive or volitive mode. In my view, one can recursively define the set of all psychological modes of attitudes. As Descartes anticipated, the two primitive modes are those of belief and...
متن کاملDenotational Semantics for Propositional Light Affine Logic
Denotational semantics often make invariants explicit which are implicit in the structure of a proof theoretic system. Asperti’s Light Affine Logic is a proof theoretic system, which can be viewed as a computation model. It was shown by Asperti and Roversi that, as a computation model, it captures the feasible functions. Light Affine Logic is a simplification of Girard’s Light Linear Logic, to ...
متن کاملReferential Matrix Semantics for Propositional Calculi
Let L be a propositional language, and let F1, . . . , Fn be all propositional connectives it involves. We shall denote the set of all formulas of L as L, and identify L with the algebra of formulas (L,F1, . . . , Fn) freely generated by the propositional letters p1, . . . , pi, . . .. Assume that T is a non-empty set of indices (points of reference, possible worlds) and assume that a certain s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1994
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1094061863